Parameterized Complexity and Biopolymer Sequence Comparison
نویسندگان
چکیده
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest common supersequence, pairwise sequence alignment, multiple sequencing alignment, structure-sequence alignment, and structure-structure alignment. Algorithm techniques built on the structural-unit level, as well as on the residue level, are discussed.
منابع مشابه
Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment
Computational alignment of a biopolymer sequence (e.g., an RNA or a protein) to a structure is an effective approach to predict and search for the structure of new sequences. To identify the structure of remote homologs, the structure-sequence alignment has to consider not only sequence similarity but also spatially conserved conformations caused by residue interactions, and consequently is com...
متن کاملTree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions
We present a general setting for structure-sequence comparison in a large class of RNA structures that unifies and generalizes a number of recent works on specific families on structures. Our approach is based on tree decomposition of structures and gives rises to a general parameterized algorithm, where the exponential part of the complexity depends on the family of structures. For each of the...
متن کاملTree Decomposition and Parameterized Algorithms for RNA Structure-Sequence Alignment Including Tertiary Interactions and Pseudoknots - (Extended Abstract)
We present a general setting for structure-sequence comparison in a large class of RNA structures that unifies and generalizes a number of recent works on specific families on structures. Our approach is based on tree decomposition of structures and gives rises to a general parameterized algorithm, where the exponential part of the complexity depends on the family of structures. For each of the...
متن کاملOn the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
We show that the Fixed Alphabet Shortest Common Supersequence (SCS) and the Fixed Alphabet Longest Common Subsequence (LCS) problems parameterized in the number of strings are W [1]-hard. Unless W [1] = FPT , this rules out the existence of algorithms with time complexity of O(f(k)n) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f ...
متن کاملParameterized complexity analysis in computational biology
Many computational problems in biology involve parameters for which a small range of values cover important applications. We argue that for many problems in this setting, parameterized computational complexity rather than NP-completeness is the appropriate tool for studying apparent intractability. At issue in the theory of parameterized complexity is whether a problem can be solved in time O(n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. J.
دوره 51 شماره
صفحات -
تاریخ انتشار 2008